Convexity Conditions for Parameterized Surfaces
نویسندگان
چکیده
Based on a geometrical method, the internal relationships between locally parameterized curves and the local parameterized surfaces are analyzed. A necessary and sufficient condition is derived for the local convexity of parameterized surfaces and functional surfaces. A criterion for local convexity (concavity) of parameterized surfaces is found, also, the criterion condition of binary function convex surfaces is obtained. Finally, the relationships between a globally parameterized curves surfaces is discussed, a necessary condition is presented for the global convexity of parameterized surfaces , and it is proved that locally convex parameterized surfaces are also globally convex.
منابع مشابه
CERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS
The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk
متن کاملLinear convexity conditions for rectangular and triangular Bernstein-Bézier surfaces
The goal of this paper is to derive linear convexity conditions for Bernstein–Bézier surfaces defined on rectangles and triangles. Previously known linear conditions are improved on, in the sense that the new conditions are weaker. Geometric interpretations are provided.
متن کاملConvexity of the Photosynthetic Light-Response Curve in Relation to Intensity and Direction of Light during Growth.
Photosynthesis in the intermediate light range is most efficient when the convexity of the photosynthetic light-response curve is high. Factors determining the convexity were examined for intact leaves using Salix sp. and for a plant cell culture using the green microalga Coccomyxa sp. It was found that the leaf had lower convexity than diluted plant cells because the light gradient through the...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملConvex Preserving Scattered Data
We use bivariate C 1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and suucient condition on Bernstein-B ezier polynomials, we set the convexity preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSW
دوره 7 شماره
صفحات -
تاریخ انتشار 2012